Infeasibility Analysis for Linear Systems, a Survey

نویسندگان

  • Katta G. Murty
  • Santosh N. Kabadi
  • R. Chandrasekaran
چکیده

We discuss infeasibility analysis (study of changes needed to make an infeasible system feasible) for systems of linear constraints.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new approach to rank the decision making units in presence of infeasibility in intuitionistic fuzzy environment

Data envelopment analysis (DEA) is a linear programming based methodology to determine the relative performance efficiencies of homogeneous decision making units (DMUs). In real world applications, some input and output datas do not possess crisp/fuzzy essence but they possess intuitionistic fuzzy (IF) essence. So, in this study, we develop an IF BCC (IFBCC) and an IF super efficiency BCC (IFSE...

متن کامل

Infeasibility resolution based on goal programming

Infeasibility resolution is an important aspect of infeasibility analysis. This paper proposes a multi-objective programming model for infeasibility resolution and develops a method based on l ∞ norm goal programming to solve the problem. Any solution is at least weakly efficient and any efficient solution is reachable by regulating the weights. For the special case of irreducibly inconsistent ...

متن کامل

Understanding the Geometry of Infeasible Perturbations of a Conic Linear System

We discuss some properties of the distance to infeasibility of a conic linear system Ax = b; x 2 C; where C is a closed convex cone. Some interesting connections between the distance to infeasibility and the solution of certain optimization problems are established. Such connections provide insight into the estimation of the distance to infeasibility and the explicit computation of infeasible p...

متن کامل

A comment on modified big-M method to recognize the infeasibility of linear programming models

This paper provides an effective modification to the big-M method which leads to reducing the iterations of this method, when it is used to recognize the infeasibility of linear systems. 2008 Elsevier B.V. All rights reserved.

متن کامل

A Method for Solving Super-Efficiency Infeasibility by Adding virtual DMUs with Mean Values

Using super-efficiency, with regard to ranking efficient units, is increasing in DEA. However, this model has some problems such as the infeasibility. Thus, this article studies infeasibility of the input-based super-efficiency model (because of the zero inputs and outputs), and presents a solution by adding two virtual DMUs with mean values (one for inputs and one for outputs). Adding virtual ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000